The Fair Division of Hereditary Set Systems
نویسندگان
چکیده
We consider the fair division of indivisible items using maximin shares measure. Recent work on topic has focused extending results beyond class additive valuation functions. In this spirit, we study case where form a hereditary set system. present simple algorithm that allocates each agent bundle whose value is at least 0.3666 times share agent. This improves upon current best known guarantee 0.2 due to Ghodsi et al. The analysis almost tight; an instance provides most 0.3738. also show can be implemented in polynomial time given oracle for
منابع مشابه
Fair Division*
Properties of discrete cake-cutting procedures that use a minimal number of cuts (n – 1 if there are n players) are analyzed. None is always envy-free or efficient, but divideand-conquer (D&C) minimizes the maximum number of players that any single player may envy. It works by asking n ≥ 2 players successively to place marks on a cake that divide it into equal or approximately equal halves, the...
متن کاملControl of Fair Division
We initiate the study of control actions in fair division problems where a benevolent or malicious central organizer changes the structure of the fair division problem for self-interest or to benefit one, some or all agents. One motivation for such control is to improve fairness by minimally changing the problem. As a case study, we consider the problem of adding or deleting a small number of i...
متن کاملParadoxes of Fair Division
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملOnline Fair Division
Hunger is a major problem even in developed countries like Australia. We are working with a social startup, Foodbank Local, and local charities at distributing donated food more efficiently. This food must first be allocated to these charities and then delivered to the end customers. This fair division problem is interesting as it combines traditional features with a number of dimensions that a...
متن کاملOnline Fair Division Redux
Hunger is a major problem worldwide. Food banks around the globe combine forces with various welfare agencies towards alleviating the hunger by assisting people in need. For example, Foodbank Australia cooperates with local charities in order to effectively allocate food as it is donated. In 2014, nearly 10% of these relief organizations could not meet the demand and thus left around 24,000 chi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM transactions on economics and computation
سال: 2021
ISSN: ['2167-8383', '2167-8375']
DOI: https://doi.org/10.1145/3434410